GENERALIZED CONNECTIVITY

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Connectivity ∗

In this paper, we introduce generalized connectivity in L-fuzzy topological spaces by à Lukasiewicz logic and prove K. Fan’s theorem.

متن کامل

On generalized atom-bond connectivity index of cacti

The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for  ABCa index for cacti of order $n$ ...

متن کامل

Hardness results on generalized connectivity

Let G be a nontrivial connected graph of order n and let k be an integer with 2 ≤ k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number l of edge-disjoint trees T1, T2, . . . , Tl in G such that V (Ti)∩V (Tj) = S for every pair i, j of distinct integers with 1 ≤ i, j ≤ l. A collection {T1, T2, . . . , Tl} of trees in G with this property is called an internally disjoint set ...

متن کامل

On the generalized (edge-)connectivity of graphs

The generalized k-connectivity κk(G) of a graph G was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized k-edge-connectivity, λk(G). For general k, the generalized k-edgeconnectivity of a complete graph is obtained. For k ≥ 3, tight upper and lower bounds of κk(G) and λk(G) are given for a connected graph G of order n, namely, 1 ≤ κk(G) ≤ n− k2 and 1 ≤...

متن کامل

Restricted arc-connectivity of generalized tournaments

If D is a strongly connected digraph, then an arc set S of D is called a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc. Recently, Volkmann [12] defined the restricted arc-connectivity λ(D) as the minimum cardinality over all restricted arc-cuts S. A strongly connected digraph D is called λconnected when λ(D) exists. Let k ≥ 2 be an i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proyecciones (Antofagasta)

سال: 2006

ISSN: 0716-0917

DOI: 10.4067/s0716-09172006000200005